Probabilistic analysis of algorithms

Results: 137



#Item
31Normal distribution / Applied mathematics / Probability and statistics / Statistics / Analysis of algorithms / Probabilistic complexity theory / Randomized algorithm

Approximation Algorithms for Unique Games via Orthogonal Separators Lecture notes by Konstantin Makarychev. Lecture notes are based on the papers [CMM06a, CMM06b, LM14]. 1

Add to Reading List

Source URL: konstantin.makarychev.net

Language: English - Date: 2014-11-22 21:53:55
32Probabilistic complexity theory / Randomized algorithm / Outlier / Algorithm / RANSAC / CURE data clustering algorithm / Statistics / Robust statistics / Analysis of algorithms

CCCG 2013, Waterloo, Ontario, August 8–10, 2013 How to Cover Most of a Point Set with a V-Shape of Minimum Width Boris Aronov∗

Add to Reading List

Source URL: www.cccg.ca

Language: English - Date: 2013-08-11 21:51:58
33Analysis of algorithms / Fault-tolerant computer systems / Probabilistic complexity theory / Consensus / Randomized algorithm / Distributed algorithm / Factorial / IP / Time complexity / Theoretical computer science / Computational complexity theory / Mathematics

Distributed Agreement with Optimal Communication Complexity Seth Gilbert EPFL Abstract We consider the problem of fault-tolerant agreement in

Add to Reading List

Source URL: www.comp.nus.edu.sg

Language: English - Date: 2009-11-24 09:45:55
34Analysis of algorithms / Polynomials / Probabilistic complexity theory / Randomized algorithm / Matching / Schwartz–Zippel lemma / Time complexity / NP / Color-coding / Theoretical computer science / Applied mathematics / Mathematics

Finding a path of length k in O∗(2k ) time arXiv:0807.3026v3 [cs.DS] 9 Nov 2008 Ryan Williams∗ Carnegie Mellon University

Add to Reading List

Source URL: arxiv.org

Language: English - Date: 2008-11-08 20:04:23
35Complexity classes / Probabilistic complexity theory / Quantum complexity theory / Analysis of algorithms / Randomized algorithm / PP / NP / P / Theoretical computer science / Computational complexity theory / Applied mathematics

Uniform Generation of NP-witnesses using an NP-oracle Mihir Bellare Oded Goldreichy

Add to Reading List

Source URL: www.wisdom.weizmann.ac.il

Language: English - Date: 2014-06-22 06:24:53
36Analysis of algorithms / Computational complexity theory / Probabilistic complexity theory / Randomized algorithm / Algorithm / Complexity / Consensus / Adversary model / In-place algorithm / Theoretical computer science / Applied mathematics / Mathematics

Fast Randomized Test-and-Set and Renaming Dan Alistarh1 , Hagit Attiya1,2 , Seth Gilbert1 , Andrei Giurgiu1 , and Rachid Guerraoui1 1 Ecole Polytechnique F´ed´erale de Lausanne, Lausanne, Switzerland 2

Add to Reading List

Source URL: www.comp.nus.edu.sg

Language: English - Date: 2011-11-17 23:45:01
37Complexity classes / Probabilistic complexity theory / Analysis of algorithms / Randomized algorithm / NL / PP / Algorithm / Monte Carlo method / Scheduling / Theoretical computer science / Computational complexity theory / Applied mathematics

Exact and Approximate Probabilistic Symbolic Execution for Nondeterministic Programs Kasper S. Luckow ˘ areanu ˘

Add to Reading List

Source URL: www.cs.sun.ac.za

Language: English - Date: 2014-09-18 09:08:01
38Distributed data storage / Analysis of algorithms / Probabilistic complexity theory / Randomized algorithm / Distributed algorithm / Graph coloring / Leader election / Distributed computing / Consensus / Theoretical computer science / Mathematics / Computational complexity theory

16 CHAPTER 2. LEADER ELECTION of each node has the same structure. We will now show that non-uniform anonymous leader election for synchronous rings is impossible. The idea is that

Add to Reading List

Source URL: dcg.ethz.ch

Language: English - Date: 2014-09-26 08:28:48
39Distributed data storage / Analysis of algorithms / Probabilistic complexity theory / Randomized algorithm / Distributed algorithm / Graph coloring / Leader election / Distributed computing / Consensus / Theoretical computer science / Mathematics / Computational complexity theory

Chapter 2 Leader Election 2.1 Anonymous Leader Election

Add to Reading List

Source URL: dcg.ethz.ch

Language: English - Date: 2014-09-26 08:28:48
UPDATE